Parsing Tree Adjoining Grammars and Tree Insertion Grammars with Simultaneous Adjunctions
نویسنده
چکیده
A large part of wide coverage Tree Adjoining Grammars (TAG) is formed by trees that satisfy the restrictions imposed by Tree Insertion Grammars (TIG). This characteristic can be used to reduce the practical complexity of TAG parsing, applying the standard adjunction operation only in those cases in which the simpler cubic-time TIG adjunction cannot be applied. In this paper, we describe a parsing algorithm managing simultaneous adjunctions in TAG and TIG.
منابع مشابه
Multi-Component Tree Insertion Grammars
In this paper we introduce a new mildly context sensitive formalism called Multi-Component Tree Insertion Grammar. This formalism is a generalization of Tree Insertion Grammars in the same sense that Multi-Component Tree Adjoining Grammars is a generalization of Tree Adjoining Grammars. We show that this class of grammatical formalisms is equivalent to Multi-Component Tree Adjoining Grammars, a...
متن کاملMixed Parsing of Tree Insertion and Tree Adjoining Grammars
Adjunction is a powerful operation that makes Tree Adjoining Grammar (TAG) useful for describing the syntactic structure of natural languages. In practice, a large part of wide coverage grammars written following the TAG formalism is formed by trees that can be combined by means of the simpler kind of adjunction defined for Tree Insertion Grammar. In this paper, we describe a parsing algorithm ...
متن کاملPreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملAnálisis ascendente bidireccional de TAG dirigido por el núcleo TIG
We define a bidireccional bottom-up parser for Tree Adjoining Grammars (TAG). This parser is a mixture of a defined bidireccional bottom-up parser for TAG and a new parser for Tree Insertion Grammars (TIG) that we present here. We show that the new mixed parser for TAG presents a significative reduction of the theoretical complexity.
متن کاملAnálisis ascendente bidireccional de TAG
We define a bidireccional bottom-up parser for Tree Adjoining Grammars (TAG). This parser is a mixture of a defined bidireccional bottom-up parser for TAG and a new parser for Tree Insertion Grammars (TIG) that we present here. We show that the new mixed parser for TAG presents a significative reduction of the theoretical complexity.
متن کامل